Reformulating Mixed-Integer Quadratically Constrained Quadratic Programs
نویسندگان
چکیده
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather than merely relax them. The purpose of reformulation is to strengthen the continuous relaxation of the problem, while leaving the optimal solution unchanged. In this paper, we explore the possibility of extending the reformulation approach to the (much) more general case of mixed-integer quadratically constrained quadratic programs.
منابع مشابه
GloMIQO: Global mixed-integer quadratic optimizer
This paper introduces the Global Mixed-Integer Quadratic Optimizer, GloMIQO, a numerical solver addressing mixed-integer quadratically-constrained quadratic programs (MIQCQP) to ε-global optimality. The algorithmic components are presented for: reformulating user input, detecting special structure including convexity and edge-concavity, generating tight convex relaxations, partitioning the sear...
متن کاملConvex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations
This paper addresses the problem of generating strong convex relaxations of Mixed Integer Quadratically Constrained Programming (MIQCP) problems. MIQCP problems are very difficult because they combine two kinds of non-convexities: integer variables and non-convex quadratic constraints. To produce strong relaxations of MIQCP problems, we use techniques from disjunctive programming and the lift-a...
متن کاملDisjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
This paper addresses the problem of generating strong convex relaxations of Mixed Integer Quadratically Constrained Programming (MIQCP) problems. MIQCP problems are very difficult because they combine two kinds of non-convexities: integer variables and nonconvex quadratic constraints. To produce strong relaxations of MIQCP problems, we use techniques from disjunctive programming and the liftand...
متن کاملGlobal optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
We propose a deterministic global optimization approach, whose novel contributions are rooted in the edge-concave and piecewise-linear underestimators, to address nonconvex mixed-integer quadratically-constrained quadratic programs (MIQCQP) to ε-global optimality. The facets of low-dimensional (n≤ 3) edge-concave aggregations dominating the termwise relaxation of MIQCQP are introduced at every ...
متن کاملANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations
This manuscript introduces ANTIGONE, Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations, a general mixed-integer nonlinear global optimization framework. ANTIGONE is the evolution of the Global Mixed-Integer Quadratic Optimizer, GloMIQO, to general nonconvex terms. The purpose of this paper is to show how the extensible structure of ANTIGONE realizes our previously-p...
متن کامل